Corrigendum: Maximum packings of Kn with hexagons
نویسنده
چکیده
Example 4.31. (K16 , P) : P = {(1, 3,5,10,16,15), (1, 4, 6,13,14,11), (1,5, 7,12, 15,10),(1,16,12,10,9,14),(2,3,6,9,11,13),(2,4, 7,10,13,9), (2,5,13,7,11,10), (1, 6, 2, 7,3,8), (1, 7, 8, 11,6,12), (3, 13, 1,9,7,14), (2,11,3,10,6,14),(3,15,14,16,8,12),(4,9,16,7,15,11),(4,10,14,8,13,15), (4,13,16,11,5,14),(8,2,12,5,9,15),(16,3,9,12,4,5),(5,15,6,16,4,8)}; L {(5, 6), (6,7), (6, 8), (8,9), (8, 10), (11, 12), (12,13), (12,14), (1, 2), (2, 15), (2,16), (3, 4)}.
منابع مشابه
Maximum packings of Kn with hexagons
A complete solution of the maximum packing problem of Kn with hexagons is given.
متن کاملMinimum coverings of Kn with hexagons
The edge set of Kn cannot be decomposed into edge-disjoint hexagons (or 6-cycles) when n =1= 1 or 9 (mod 12). We discuss adding edges to the edge set of Kn so that the resulting graph can be decomposed into edge-disjoint hexagons. This paper gives the solution to this minimum covering of Kn with hexagons problem.
متن کاملAlmost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
If the complete graph Kn has vertex set X , a maximum packing of Kn with 4-cycles, (X,C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum pac...
متن کاملPacking and covering the complete graph with cubes
A decomposition of Kn \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum packing of Kn with G if L contains as few edges as possible. A decomposition of Kn U P, the complete graph union a graph P (called the padding), into edge disjoint copies of a graph G is called a minimum covering of Kn with G if P conta...
متن کاملMaximum packings of Kn with k-stars
Given graphs G and H, we define an H-packing of G to be a partition of the edges of G into some copies of H along with a set of edges L, called the leave. An H-packing is called maximum when |L| is minimum, or equivalently, when the H-packing contains as many copies of H as possible. A k-star, denoted Sk, is defined to be the complete bipartite graph K1,k. In this paper we characterize the numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 10 شماره
صفحات -
تاریخ انتشار 1994